Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions
نویسندگان
چکیده
منابع مشابه
Paths of Cultural Systems
A theory of cultural structures predicts the objects observed by anthropologists. We here define those which use kinship relationships to define systems. A finite structure we call a partially defined quasigroup (or pdq, as stated by Definition 1 below) on a dictionary (called a natural language) allows prediction of certain anthropological descriptions, using homomorphisms of pdqs onto finite ...
متن کاملAssessing Perceptions AbouT Hazardous Substances (PATHS): The PATHS questionnaire
How people perceive the nature of a hazardous substance may determine how they respond when potentially exposed to it. We tested a new Perceptions AbouT Hazardous Substances (PATHS) questionnaire. In Study 1 (N = 21), we assessed the face validity of items concerning perceptions about eight properties of a hazardous substance. In Study 2 (N = 2030), we tested the factor structure, reliability a...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملPaths with no Small Angles
Giving a (partial) solution to a problem of S. Fekete [3] and S. Fekete and G.J. Woeginger [4] we show that given a finite set X of points in the plane, it is possible to find a polygonal path with |X|−1 segments and with vertex set X so that every angle on the polygonal path is at least π/9. According to a conjecture of Fekete and Woeginger, π/9 can be replaced by π/6. Previously, the result h...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hydrology and Earth System Sciences
سال: 2014
ISSN: 1607-7938
DOI: 10.5194/hess-18-109-2014